Voronoi diagrams with respect to criteria on vision information
نویسندگان
چکیده
منابع مشابه
Voronoi Diagram with Respect to Criteria on Vision Information Short Running Title: Voronoi Diagram on Vision Information
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predetermined criterion. In this paper we are interested in various measures associated with criteria on goodness of an input line segment with respect to each point in the plane as the ”point of view”. These measures basica...
متن کاملMulti-Criteria Optimal Location Query with Overlapping Voronoi Diagrams
This paper presents a novel optimal location selection problem, which can be applied to a wide range of applications. After providing a formal definition of the novel query type, we explore an intuitive approach that sequentially scans all possible object combinations in the search space. Then, we propose an Overlapping Voronoi Diagram (OVD) model that defines OVDs and Minimum OVDs, and constru...
متن کاملImplementation Roadmap using Voronoi Diagrams for Vision-based Robot Motion
In this paper, we present a method to navigate a mobile robot using a webcam. This method determines the shortest path for the robot to transverse to its target location, while avoiding obstacles along the way. The environment is first captured as an image using a webcam. Image processing methods are then performed to identify the existence of obstacles within the environment. Using the Voronoi...
متن کاملVoronoi Diagrams on the Sphere
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کاملVoronoi diagrams on the spher
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2008
ISSN: 0916-7005,1868-937X
DOI: 10.1007/bf03167517